Indexes and Special Discretization Methods for Linear partial Differential Algebraic Equations

Linear partial differential algebraic equations (PDAEs) of the form Au _t(t, x) + Bu _xx(t, x) + Cu(t, x) = f(t, x) are studied where at least one of the matrices A, B R ^n×n is singular. For these systems we introduce a uniform differential time index and a differential space index. We show that in contrast to problems with regular matrices A and B the initial conditions and/or boundary conditions for problems with singular matrices A and B have to fulfill certain consistency conditions. Furthermore, two numerical methods for solving PDAEs are considered. In two theorems it is shown that there is a strong dependence of the order of convergence on these indexes. We present examples for the calculation of the order of convergence and give results of numerical calculations for several aspects encountered in the numerical solution of PDAEs.     

一类非线性代数方程组的并行迭代算法

１．引言考虑非线性代数方程组这里,　　　　　　　　　　　　　　　　　　　　　　　　　　　　为连续的对角映射,二者的导函数均存在,但并不一定连续．这类非线性代数方程组具有丰富的实际背景．譬如,Ｓｔｅｆａｎ问题和许多弱非线性椭圆型偏微分方程,就可归结为（１．１）的数值求解问题．根据方程组（１．１）的特殊结构,并利用矩阵多重分裂思想,文ｔＺ］讨论了一类并行非线性Ｇａｕｓｓ－Ｓｅｉｄｅｌ型迭代算法．这类算法具有很好的数值性质和较高的并行效率·在此基础上,运用松弛加速技术,文［８］进一步研究了一类并行多分…     

Complex Zeros of Algebraic Polynomial with Non-Zero Mean Random Coefficients

In this paper we obtain a formula for the average density of the distribution of complex zeros of an algebraic polynomial with random coefficients. The coefficients are assumed independent identical normally distributed random variables with mean and variance ². The value of the average density for the case of =0 and ²=1 was obtained previously. Some limits of the distribution of the complex zeros are provided using the presented formula.     

Computation of generalized real radicals of polynomial ideals

For an ordered field (K,T) and an idealI of the polynomial ring , the construction of the generalized real radical ofI is investigated. When (K,T) satisfies some computational requirements, a method of computing is presented. Project supported by the National Natural Science Foundation of China (Grant No. 19661002) and the Climbing Project.     

Algebraic domain decomposition solver for linear elasticity

We generalize the overlapping Schwarz domain decomposition method to problems of linear elasticity. The convergence rate independent of the mesh size, coarse-space size, Korn's constant and essential boundary conditions is proved here. Abstract convergence bounds developed here can be used for an analysis of the method applied to singular perturbations of other elliptic problems.     

G. Martens′ Dimension Theorem for Curves of Odd Gonality

For a smooth projective irreducible algebraic curve C of odd gonality, the maximal possible dimension of the variety of special linear systems W _d ^r (C) is d-3r by a result of M. Coppens et al. Furthermore it is known that if the maximum dimension of W(C) for a curve C of odd gonality is attained then C is of very special type of curves by the recent progress made by G. Martens. The purpose of this paper is to chase an extension of the result of G. Martens; if dim W(C)=d-3r-1 for a curve C of odd gonality for some dg-4 and r1, then C must be either a smooth plane sextic, a pentagonal curve of bounded genus or a smooth plane octic.     

Transfer Operators and State Spaces for Discrete Multidimensional Linear Systems

This paper treats multidimensional discrete input-output systems from the constructive point of view. We adapt and improve recursive algorithms, derived earlier by E. Zerz and the second author from standard Gröbner basis algorithms, for the solution of the canonical Cauchy problem for linear systems of partial difference equations with constant coefficients on the lattices N = ^r1 × ^r2. These recursive algorithms, in turn, furnish four other solution methods for the initial value problem, namely by transfer operators, by canonical Kalman global state equations, by parametrizations of controllable systems and, for systems with proper transfer matrix and left bounded input signals, by convolution with the transfer matrix. In the 2D-case N = ² the last method was studied by S. Zampieri. Minimally embedded systems are studied and give rise to especially simple Kalman equations. The latter also imply a useful characterization of the characteristic or polar variety of the system by eigenvalue spectra. For N = ^r we define reachability of a system and prove that controllability implies reachability, but not conversely. Moreover we solve, in full generality, the modelling problem which was introduced and partially solved by F. Pauer and S. Zampieri. Various algorithms have been implemented by the first author in axiom, and examples are demonstrated by means of computer generated pictures. Related work on state space representations has been done by the Padovian and Groningian system theory schools.     

K1 of Twisted Rings of Polynomials

We prove that for an arbitrary endomorphism of a ring R the group K1(R[t]) splits into the direct sum of K1(R) and Ñil (r;). Moreover, for any such R and Ñil (R; ) is isomorphic to Ñil (R ; ) for some ring R with : R R – an isomorphism.     

On random algebraic polynomials

This paper provides asymptotic estimates for the expected number of real zeros and -level crossings of a random algebraic polynomial of the form , where are independent standard normal random variables and is a constant independent of . It is shown that these asymptotic estimates are much greater than those for algebraic polynomials of the form .

     

Maximum principle for control problems with uncertain horizon and variable discount rate

We consider an optimal control problem in which the time horizon is a random variable and the discount factor may depend on the past state and control values. This problem combines features of controlled piecewise deterministic processes and recursive utility maximization. Applying a simple transformation and a refined version of Halkin's proof of the maximum principle for optimal control problems on unbounded time intervals (Ref. 1), we obtain the maximum principle for the problem under consideration. Our assumptions are weaker than those of related results in the literature.This research was supported by a grant from the Austrian Science Foundation, Vienna, Austria.